An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups - Information Theory, IEEE Transactions on

An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups

An Efficient Algorithm for Constructing Trellises for Codes over Finite Abelian Groups

Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups

A definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite abelian group can be constructed from its characteristic generators, which extends the work of Koetter and Vardy who treated the case of a linear code over a f...

On the Intractability of Permuting a Block Code to Minimize Trellis Complexity [Correspondence] - Information Theory, IEEE Transactions on

A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product...

An E cient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups

We present an eecient algorithm for computing the minimal trellis for a group code over a nite Abelian group, given a generator matrix for the code. We also show how to compute a succinct representation of the minimal trellis for such a code, and present algorithms that use this information to eeciently compute local descriptions of the minimal trellis. This extends the work of Kschischang and ...